Polygon labelling of minimum leader length

نویسندگان

  • Michael A. Bekos
  • Michael Kaufmann
  • Katerina Potika
  • Antonios Symvonis
چکیده

We study a variation of the boundary labelling problem, with floating sites (represented as polygons), labels of uniform size placed in fixed positions on the boundary of a rectangle (that encloses all sites) and special type of leaders connecting labels to sites. We seek to obtain a labelling of all sites with leaders that are non-overlapping and have minimum total length. We present an O(n log n) time algorithm for the labelling of polygons.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Boundary Labelling of Optimal Total Leader Length

In this paper, we consider the leader length minimization problem for boundary labelling, i.e. the problem of finding a legal leaderlabel placement, such that the total leader length is minimized. We present an O(nlogn) algorithm assuming type-opo leaders (rectilinear lines with either zero or two bends) and labels of uniform size which can be attached to all four sides of rectangle R. Our algo...

متن کامل

A Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars

Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...

متن کامل

The Smallest Pair of Noncrossing Paths in a Rectilinear Polygon

Smallest rectilinear paths are rectilinear paths with a minimum number of bends and with a minimum length, simultaneously. In this paper, given two pairs of terminals within a rectilinear polygon, we derive an algorithm to find a pair of noncrossing rectilinear paths within the polygon such that the total number of bends and the total length are both minimized. Although a smallest rectilinear p...

متن کامل

Recursive computation of minimum-length polygons

The relative convex hull, or the minimum-perimeter polygon (MPP) of a simple polygon A, contained in a second polygon B, is a unique polygon in the set of nested polygons between A and B. The computation of the minimum-length polygon (MLP), as a special case for isothetic polygons A and B, is useful for various applications in image analysis and robotics. The paper discusses the first recursive...

متن کامل

Point Labeling with Leaders for Convex Boundaries

This diploma thesis deals with the concept of convex boundary labeling. Given a set of points positioned in a map with a polygonal shape, the objective is to place, for each point, a rectangular label outside of the map, and connect it to the point with a leader. Generally, the labels are placed so that no two leaders intersect and so that the total leader length is minimized. The main contribu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006